Building a search engine to drive problem-based learning
نویسندگان
چکیده
منابع مشابه
A Learning Based Search Engine Selection Technique
A good search engine selection algorithm should identify potentially useful databases accurately. Many approaches have been proposed to tackle the database selection problem. Such as Rough approach, static approach and learning approach. To fulfill the demand of users and help them to be more effective on selecting relevant and useful search engines, this paper presents a search engine selectio...
متن کاملBuilding a Funky Interface to a Web Search Engine
Acknowledgements Writing a dissertation is an enormous effort for me. It is my great pleasure to acknowledge the kind support of my supervisor, Dr. Mark Sanderson who provided important attention and time throughout the period of my MSc study. Without his friendly and valuable assistance, my study in Britain would not have been so successful. Most importantly, I am very grateful to my family fo...
متن کاملTibianna: A Learning-Based Search Engine with Query Refinement
While web search engine technology has improved over time, there is often a fundamental reliance on keyword matching for searches. What happens however, when the user does not know what keywords to use? This paper presents preliminary learning results of a prototype learning search engine that attempts to address this problem. Tibianna allows a user to manually rank a set of results based on th...
متن کاملA Tabu Search Based Solution Approach to the Competitive Multiple Allocation Hub Location Problem
The hub location problems (HLP) constitute an important class of facility location problems that have been addressed by numerous operations researchers in recent years. HLP is a strategic problem frequently encountered in designing logistics and transportation networks. Here, we address the competitive multiple allocation HLP in a duopoly market. It is assumed that an incumbent firm (the leader...
متن کاملBuilding Scalable Multimedia Search Engine Using Infiniband
The approach of vertically partitioning the index has long been considered as impractical for building a distributed search engine due to its high communication cost. With the recent surge of interest in using High Performance Computing networks such as Infiniband in the data center, we argue that vertical partitioning is not only practical but also highly scalable. To demonstrate our point, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGCSE Bulletin
سال: 2006
ISSN: 0097-8418
DOI: 10.1145/1140123.1140166